Cubic graphs with equal independence number and matching number
نویسندگان
چکیده
Caro, Davila, and Pepper recently proved δ(G)α(G)≤Δ(G)μ(G) for every graph G with minimum degree δ(G), maximum Δ(G), independence number α(G), matching μ(G). Answering some problems they posed, we characterize the extremal graphs δ(G)<Δ(G) as well δ(G)=Δ(G)=3.
منابع مشابه
On the Independence Number of Random Cubic Graphs
We show that as n —> oo, the independence number c*(G), for almost all 3-regular graphs G on n vertices, is at least (61og(3/2) — 2 — e)n, for any constant e > 0. We prove this by analyzing a greedy algorithm for finding independent sets.
متن کاملGraphs with restricted valency and matching number
Consider the family of all finite graphs with maximum degree ∆(G) < d and matching number ν(G) < m. In this paper we give a new proof to obtain the exact upper bound for the number of edges in such graphs and also characterize all the cases when the maximal graph is unique. We also provide a new proof of Gallai’s lemma concerning factor critical graphs.
متن کاملIndependence Number and Disjoint Theta Graphs
The goal of this paper is to find vertex disjoint even cycles in graphs. For this purpose, define a θ-graph to be a pair of vertices u, v with three internally disjoint paths joining u to v. Given an independence number α and a fixed integer k, the results contained in this paper provide sharp bounds on the order f(k, α) of a graph with independence number α(G) ≤ α which contains no k disjoint ...
متن کاملGame matching number of graphs
We study a competitive optimization version of α(G), the maximum size of a matching in a graph G. Players alternate adding edges of G to a matching until it becomes a maximal matching. One player (Max) wants that matching to be large; the other (Min) wants it to be small. The resulting sizes under optimal play when Max or Min starts are denoted α g(G) and α̂ ′ g(G), respectively. We show that al...
متن کاملGraphs with Equal Domination and Independent Domination Number
A set S of vertices of a graph G is an independent dominating set of G if S is an independent set and every vertex not in S is adjacent to a vertex in S. The independent domination number of G, denoted by i(G), is the minimum cardinality of an independent dominating set of G. In this paper, some new classes of graphs with equal domination and independent domination numbers are presented and exa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2021
ISSN: ['1872-681X', '0012-365X']
DOI: https://doi.org/10.1016/j.disc.2020.112178